A New Approach for Sensitivity Analysis in Network Flow Problems

Authors

  • Asghar Aini Sharif University of Technology
  • Kourosh Eshghi Sharif University of Technology
  • Amir Salehipour Australian Research Council DECRA Fellow University of Technology Sydney

DOI:

https://doi.org/10.23055/ijietap.2020.27.1.4267

Keywords:

Network flows, Minimum spanning tree, Sensitivity analysis, Shortest path network re-optimization.

Abstract

This paper proposes a new approach to study the sensitivity analysis in the network ow problems, in particular, the minimum spanning tree and shortest path problems. In a sensitivity analysis, one looks for the amount of changes in the edges' weights, number of edges or number of vertices such that the optimal solution, i.e. the minimum spanning tree or shortest path does not change. We introduce a novel approach for this purpose, and develop associated mathematics. We discuss
two illustrative examples to show the applicability of the proposed approach.

Author Biography

Asghar Aini, Sharif University of Technology

I am Asghar Aini. I am PH.D. Student at Sharif University of Technology Now. I am interested in Combinatorial Optimization Problems, Network Thoery and Algorithm Design.

Published

2020-02-17

How to Cite

Aini, A., Eshghi, K., & Salehipour, A. (2020). A New Approach for Sensitivity Analysis in Network Flow Problems. International Journal of Industrial Engineering: Theory, Applications and Practice, 27(1). https://doi.org/10.23055/ijietap.2020.27.1.4267

Issue

Section

Operations Research